A Quasi-shrinking rectangle algorithm for complex zeros of a function
نویسنده
چکیده
Presented here is a quasi-shrinking rectangle algorithm that computes a complex zero of a polynomial or transcendental function. This method has been implemented using several quasi-random number sequences and the results of several test examples are presented. The performance of this algorithm is based on a ranked comparison of relative error and time complexity versus several pseudo-random number sequences. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملالگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملPrecise Zeros of Analytic Functions Using Interval Arithmetic
An interval arithmetic algorithm for the computation of the zeros of an analytic function inside a given rectangle is presented. It is based on the argument principle in the set of complex numbers C, is guaranteed to converge, and delivers its answers to a prespecified accuracy. The precision of computation is varied dynamically to maximize efficiency. Предлагается алгоритм на базе интервальной...
متن کاملA parallel complex zero finder
A recent paper 7] describes a variable precision interval arithmetic algorithm for the computation of the zeros of an analytic function inside a given rectangle and to a user-speciied accuracy. The algorithm is based on the argument principle in the set of complex numbers C and carries much potential for parallelization at various levels of granularity. Here we explain how to modify the sequent...
متن کاملInequalities for the polar derivative of a polynomial with $S$-fold zeros at the origin
Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$, let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$. Dewan et al proved that if $p(z)$ has all its zeros in $|z| leq k, (kleq 1),$ with $s$-fold zeros at the origin then for every $alphainmathbb{C}$ with $|alpha|geq k$, begin{align*} max_{|z|=...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 185 شماره
صفحات -
تاریخ انتشار 2007